| Definitions | (x  l), E(X), prior-f-fixedpoints(e), f**(e), [],  A, [car / cdr], ES, False, AbsInterface(A), x:A  B(x),  x:A. B(x), l1  l2, P   Q, x:A  B(x),  b, left + right, P  Q, s = t, (e < e'), e c e', {x:A| B(x)} , a < b,  x:A. B(x), Void, Top, f(a), E,  , t T, EState(T), a:A fp B(a), Id,  , strong-subtype(A;B), Type, EqDecider(T), Unit, IdLnk, EOrderAxioms(E; pred?; info), kindcase(k; a.f(a); l,t.g(l;t) ), Knd, loc(e), kind(e), Msg(M), type List,  , val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), r s, e < e', constant_function(f;A;B), SWellFounded(R(x;y)),  , pred!(e;e'),   x,y. t(x;y), <a, b>, pred(e), first(e), x. t(x), P & Q, let x,y = A in B(x;y), t.1, S  T, ||as||, A B,  , l[i], A c B, suptype(S; T), e  X, last(L), ff, inr x , tt, inl x , True, case b of inl(x) => s(x) | inr(y) => t(y), if b then t else f fi ,  T, P  Q, P Q, Dec(P), b | a, a ~ b, a b, a <p b, a < b, x f y, xL. P(x), (xL.P(x)), y is f*(x), r < s, q-rel(r;x), Outcome, l_disjoint(T;l1;l2), (e <loc e'), e loc e' , e<e'.P(e), ee'.P(e), e<e'. P(e), ee'.P(e), e[e1,e2).P(e), e[e1,e2).P(e), e[e1,e2].P(e), e[e1,e2].P(e), e(e1,e2].P(e), SqStable(P), a =!x:T. Q(x), InvFuns(A;B;f;g), Inj(A;B;f), IsEqFun(T;eq), Refl(T;x,y.E(x;y)), Sym(T;x,y.E(x;y)), Trans(T;x,y.E(x;y)), AntiSym(T;x,y.R(x;y)), Connex(T;x,y.R(x;y)), CoPrime(a,b), Ident(T;op;id), Assoc(T;op), Comm(T;op), Inverse(T;op;id;inv), BiLinear(T;pl;tm), IsBilinear(A;B;C;+a;+b;+c;f), IsAction(A;x;e;S;f), Dist1op2opLR(A;1op;2op), fun_thru_1op(A;B;opa;opb;f), FunThru2op(A;B;opa;opb;f), Cancel(T;S;op), monot(T;x,y.R(x;y);f), IsMonoid(T;op;id), IsGroup(T;op;id;inv), IsMonHom{M1,M2}(f), a b, IsIntegDom(r), IsPrimeIdeal(R;P), f g, {T}, s ~ t, SQType(T), t ...$L, #$n, |g|, no_repeats(T;l),  x:A.B(x), null(as), x before y l, L1 L2 |
